Maintaining Triangle Queries under Updates
نویسندگان
چکیده
منابع مشابه
Maintaining Data Cubes under Dimension Updates
OLAP systems support data analysis through a mul-tidimensional data model, according to which data facts are viewed as points in a space of application-related \dimensions", organized into levels which conform a hierarchy. The usual assumption is that the data points reeect the dynamic aspect of the data warehouse, while dimensions are relatively static. However, in practice, dimension updates ...
متن کاملMaintaining Partial Path Consistency in STNs under Event-Incremental Updates
Efficient management of temporal constraints is important for temporal planning. During plan development, many solvers employ a heuristic-driven backtracking approach, over the course of which they maintain a so-called Simple Temporal Network (STN) of events and constraints. This paper presents the Vertex-IPPC algorithm, which efficiently enforces partial path consistency when an STN is extende...
متن کاملAnswering FO+MOD Queries Under Updates on Bounded Degree Databases
We investigate the query evaluation problem for fixed queries over fully dynamic databases, where tuples can be inserted or deleted. The task is to design a dynamic algorithm that immediately reports the new result of a fixed query after every database update. We consider queries in first-order logic (FO) and its extension with modulo-counting quantifiers (FO+MOD), and show that they can be eff...
متن کاملMaintaining consistent results of continuous queries under diverse window specifications
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving –yet restricted– set of tuples and thus provide timely and incremental results. Although sliding windows get frequently employed in many user requests, additional types like partitioned or landmark windows are also available in stream processing engines. In this paper, we set out t...
متن کاملQueries Independent of Updates
This paper considers the problem of detecting independence of a queries expressed by datalog programs from updates. We provide new insight into the independence problem by reducing it to the equivalence problem for datalog programs (both for the case of insertion and deletion updates). Equivalence, as well as independence, is undecidable in general. However, algorithms for detecting subclasses ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2020
ISSN: 0362-5915,1557-4644
DOI: 10.1145/3396375